'Weak Dependency Graph [60.0]'
------------------------------
Answer:           YES(?,O(1))
Input Problem:    innermost runtime-complexity with respect to
  Rules:
    {  gcd(x, 0()) -> x
     , gcd(0(), y) -> y
     , gcd(s(x), s(y)) ->
       if(<(x, y), gcd(s(x), -(y, x)), gcd(-(x, y), s(y)))}

Details:         
  We have computed the following set of weak (innermost) dependency pairs:
   {  gcd^#(x, 0()) -> c_0()
    , gcd^#(0(), y) -> c_1()
    , gcd^#(s(x), s(y)) ->
      c_2(gcd^#(s(x), -(y, x)), gcd^#(-(x, y), s(y)))}
  
  The usable rules are:
   {}
  
  The dependency graph contains no edges.
  
  We are done: the estimated dependency graph contains no edges and moreover, the usable rules are empty.